First-Order Average Consensus for Cooperative Control Problems Using Novel Weighting Strategies
نویسندگان
چکیده
منابع مشابه
Consensus strategies for cooperative control of vehicle formations
Extensions of a consensus algorithm are introduced for systems modelled by second-order dynamics. Variants of those consensus algorithms are applied to tackle formation control problems by appropriately choosing information states on which consensus is reached. Even in the absence of centralised leadership, the consensus-based formation control strategies can guarantee accurate formation mainte...
متن کاملDistributed Cooperative Spectrum Sensing Using Weighted Average Consensus
In this paper, we study the distributed spectrum sensing in cognitive radio networks. Existing distributed consensus-based fusion algorithms only ensure equal gain combining of local measurements, whose performance may be incomparable to various centralized soft combining schemes. Motivated by this fact, we consider practical channel conditions and link failures, and develop new weighted soft m...
متن کاملTopics on the average consensus problems
The research field of networked systems has burgeoned during the last years attracting the attention of outstanding mathematicians, computer scientists and electrical engineers. This is due in no small part to the recent technological advances in communication and computation and to the miniaturization of electronic components which have made large groups of embedded systems, such as sensors an...
متن کاملFirst Order Conditions for Nonsmooth Discretized Constrained Optimal Control Problems
This paper studies first order conditions (Karush–Kuhn–Tucker conditions) for discretized optimal control problems with nonsmooth constraints. We present a simple condition which can be used to verify that a local optimal point satisfies the first order conditions and that a point satisfying the first order conditions is a global or local optimal solution of the optimal control problem.
متن کاملAverage consensus with weighting matrix design for quantized communication on directed switching graphs
We study average consensus for directed graphs with quantized communication under fixed and switching topologies. In the presence of quantization errors, conventional consensus algorithms fail to converge and may suffer from an unbounded asymptotic mean square error. We develop robust consensus algorithms to reduce the effect of quantization. Specifically, we introduce a robust weighting matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.1865